Iterative Compression and Exact Algorithms

نویسندگان

  • Fedor V. Fomin
  • Serge Gaspers
  • Dieter Kratsch
  • Mathieu Liedloff
  • Saket Saurabh
چکیده

Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponential time algorithms to solve NP-hard problems. We exemplify our findings with algorithms for the Maximum Independent Set problem, a parameterized and a counting version of d-Hitting Set and the Maximum Induced Cluster Subgraph problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Innovative Method for The Analysis of Structures with Tension-only Members

Due to their dual behavior under tension and compression, structures with tension-only members show non-linear behavior. To analize such structures, it is necessary to use a nonlinear analysis scheme. Nonlinear analysis methods generally use gradual loading techniques with/without modification of stiffness matrix of the structure. These methods, in addition to being time consuming algorithms, a...

متن کامل

An Innovative Method for The Analysis of Structures with Tension-only Members

Due to their dual behavior under tension and compression, structures with tension-only members show non-linear behavior. To analize such structures, it is necessary to use a nonlinear analysis scheme. Nonlinear analysis methods generally use gradual loading techniques with/without modification of stiffness matrix of the structure. These methods, in addition to being time consuming algorithms, a...

متن کامل

Residual norm steepest descent based iterative algorithms for Sylvester tensor equations

Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 411  شماره 

صفحات  -

تاریخ انتشار 2008